public class ArrayAssignment1Template {

	public static void main(String[] args) {
		int[] a1 = { 2, 4, 6, 7, 10 };
		int[] a2 = new int[10];
		int[] a3 = { 2, 10, 7, 4, 6 };
		a2[8] = 999;

		printArray(a1);
		printArrayReverse(a1);
		printArray(a2);
		printArrayReverse(a2);

		findValue(a1, 6);
		findValue(a1, 8);
		findValueReverse(a2,0);
		findValueReverse(a1,2);
		findValueReverse(a1,1);

		System.out.println("\nHistogram for array 3:");
		printHistogram(a3);
	}

	public static void findValue(int[] a, int value, boolean reverse) {
		int index;
		if(reverse) {
			index = linearSearchReverse(a, value);
		} else {
			index = linearSearch(a, value);
		}
		System.out.print("The value " + value + " was ");
		if(index == -1) {
			System.out.println("not found in the array.");
		} else {
			System.out.println("was found at index " + index);
		}
	}

	public static void findValue(int[] a, int value) {
		findValue(a, value, false);
	}

	public static void findValueReverse(int[] a, int value) {
		findValue(a, value, true);
	}

	public static void printArray(int[] a) {
		// *** REPLACE THIS LINE OF CODE WITH YOUR CODE ***
		System.out.println("printArray not implemented");
	}
	public static void printArrayReverse(int[] a) {
		// *** REPLACE THIS LINE OF CODE WITH YOUR CODE ***
		System.out.println("printArrayReverse not implemented");
	}

	public static int linearSearch(int[] a, int value) {
		// *** WRITE YOUR CODE FOR linearSearch HERE ***
		return -1;
	}
	public static int linearSearchReverse(int[] a, int value) {
		// *** WRITE YOUR CODE FOR linearSearchReverse HERE ***
		return -1;
	}
	public static void printHistogram(int[] a) {
		// *** REPLACE THIS LINE OF CODE WITH YOUR CODE ***
		System.out.println("printHistogram not implemented");
	}

}